More results on Ramsey - Turán Type problems
نویسندگان
چکیده
In her paper [9] the third author raised a general scheme of new problems. These problems can be considered as common generalizations of the problems treated in the classical results of Ramsey and Turan Since 1969 she and the first author have published a sequence of papers on the subjcc’i [5], [(;I. [4]. This work is a continuation of the above sequence. We are going to define the Ramsey-Turin function KT (,. .) below. Our main aim is to give ieasonable estimates for this function in some special cases. However before doing this we have to say a few words about notation. We hope ?hat in general these will be standard and self-explanatory, but we cln rtof stick to the special notation used in the earlier papers mentioned above. In what follows the letters k, l, m, n, Y, s, t de:rote non-negative integers. We set n={O, 1, . . . . n-l}. For;;C$ry sets A, B let [A]“=(XcA: !X]=ti}, [A]‘“= {XcA: IXjrf2}, etc. , let [A, B]“*m={XcdUB: pm+ =nAIXflBI=m}. For an arbitrary sequence &, . . ., k,-, the Ramsey function R&, , .., k,-,) equals to the minimal n such that for ail s-partitions [n+l]“= IJ EI of length icr r of n+l there are icr and Acn+l such that IAIzki and A is homogeneous for the partition in the class & i.e. [A]“cE,.
منابع مشابه
Ramsey Numbers for Partially-ordered Sets
We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey numbers. We formalize situations in which we can use arbitrary families of partially-ordered sets to form host graphs for Ramsey problems. We explore connections to well studied Turán-type problems in partially-ordered sets, particularly th...
متن کاملA few remarks on Ramsey-Tura'n-type problems
Let H be a fixed forbidden graph and let f be a function of n: Denote by RTðn;H; f ðnÞÞ the maximum number of edges a graph G on n vertices can have without containing H as a subgraph and also without having at least f ðnÞ independent vertices. The problem of estimating RTðn;H; f ðnÞÞ is one of the central questions of so-called Ramsey–Turán theory. In their recent paper (Discrete Math. 229 (20...
متن کاملRamsey goodness and beyond
In a seminal paper from 1983, Burr and Erd1⁄2os started the systematic study of Ramsey numbers of cliques vs. large sparse graphs, raising a number of problems. In this paper we develop a new approach to such Ramsey problems using a mix of the Szemerédi regularity lemma, embedding of sparse graphs, Turán type stability, and other structural results. We give exact Ramsey numbers for various clas...
متن کاملA new class of Ramsey-Turán problems
We introduce and study a new type of Ramsey-Turán problems, a typical example of which is the following one: Let " > 0 and G be a graph of su¢ ciently large order n with minimum degree (G) > 3n=4: If the edges of G are colored in blue or red, then for all k 2 [4; b(1=8 ")nc] ; there exists a monochromatic cycle of length k: Keywords: Ramsey-Turán problems; minimum degree; monochromatic cycles. ...
متن کاملOn a Ramsey-type problem and the Turán numbers
For each n and k, we examine bounds on the largest number m so that for any k-coloring of the edges of Kn there exists a copy of Km whose edges receive at most k − 1 colors. We show that for k ≥ √n+ Ω(n), the largest value of m is asymptotically equal to the Turán number t(n, bn2 ) /kc), while for any constant > 0, if k ≤ (1 − )√n then m can be asymptotically larger than that Turán number.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorica
دوره 3 شماره
صفحات -
تاریخ انتشار 1983